首页> 外文OA文献 >Stochastic Dynamic Cache Partitioning for Encrypted Content Delivery
【2h】

Stochastic Dynamic Cache Partitioning for Encrypted Content Delivery

机译:加密内容交付的随机动态缓存分区

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

In-network caching is an appealing solution to cope with the increasingbandwidth demand of video, audio and data transfer over the Internet.Nonetheless, an increasing share of content delivery services adopt encryptionthrough HTTPS, which is not compatible with traditional ISP-managed approacheslike transparent and proxy caching. This raises the need for solutionsinvolving both Internet Service Providers (ISP) and Content Providers (CP): bydesign, the solution should preserve business-critical CP information (e.g.,content popularity, user preferences) on the one hand, while allowing for adeeper integration of caches in the ISP architecture (e.g., in 5G femto-cells)on the other hand. In this paper we address this issue by considering a content-obliviousISP-operated cache. The ISP allocates the cache storage to various contentproviders so as to maximize the bandwidth savings provided by the cache: themain novelty lies in the fact that, to protect business-critical information,ISPs only need to measure the aggregated miss rates of the individual CPs anddo not need to be aware of the objects that are requested, as in classiccaching. We propose a cache allocation algorithm based on a perturbedstochastic subgradient method, and prove that the algorithm converges close tothe allocation that maximizes the overall cache hit rate. We use extensivesimulations to validate the algorithm and to assess its convergence rate understationary and non-stationary content popularity. Our results (i) testify thefeasibility of content-oblivious caches and (ii) show that the proposedalgorithm can achieve within 10\% from the global optimum in our evaluation.
机译:网络内缓存是一种吸引人的解决方案,可以满足日益增长的Internet上视频,音频和数据传输的带宽需求。然而,越来越多的内容交付服务采用HTTPS加密,这与传统的ISP管理的方法(如透明和透明)不兼容。代理缓存。这就提出了需要同时涉及Internet服务提供商(ISP)和内容提供商(CP)的解决方案的需求:通过设计,该解决方案一方面应保留业务关键的CP信息(例如,内容的受欢迎程度,用户偏好),同时允许深入的集成另一方面,ISP体系结构(例如5G毫微微小区)中的高速缓存的数量。在本文中,我们通过考虑内容无关的ISP操作的缓存来解决此问题。 ISP将缓存存储分配给各种内容提供商,以最大程度地节省由缓存提供的带宽:主要的新颖之处在于,为了保护关键业务信息,ISP只需要测量各个CP的总未命中率即可。不需要像经典缓存那样知道所请求的对象。我们提出了一种基于扰动随机次梯度法的缓存分配算法,并证明该算法收敛于接近分配的位置,从而使整体缓存命中率最大化。我们使用广泛的仿真来验证算法并评估静态和非静态内容流行度下的收敛速度。我们的结果(i)证明了内容可忽略的缓存的可行性,并且(ii)表明,在我们的评估中,所提出的算法可以达到全局最优值的10%以内。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号